Representation of the Fibonacci and Lucas Numbers in Terms of Floor and Ceiling

نویسنده

  • Magdalena Jastrzebska
چکیده

One can prove the following propositions: (1) For all real numbers a, b and for every natural number c holds (ab ) c = a c bc . (2) For every real number a and for all integer numbers b, c such that a 6= 0 holds ab+c = ab · ac. (3) For every natural number n and for every real number a such that n is even and a 6= 0 holds (−a)n = an. (4) For every natural number n and for every real number a such that n is odd and a 6= 0 holds (−a)n = −an. (5) |τ | < 1. (6) For every natural number n and for every non empty real number r such that n is even holds rn > 0. (7) For every natural number n and for every real number r such that n is odd and r < 0 holds rn < 0.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The (non-)existence of perfect codes in Lucas cubes

A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...

متن کامل

On the sum of reciprocal Tribonacci numbers

In this paper we consider infinite sums derived from the reciprocals of the Fibonacci numbers, and infinite sums derived from the reciprocals of the square of the Fibonacci numbers. Applying the floor function to the reciprocals of these sums, we obtain equalities that involve the Fibonacci numbers.

متن کامل

ON THE GENERALIZED ORDER-k FIBONACCI AND LUCAS NUMBERS

In this paper we consider the generalized order-k Fibonacci and Lucas numbers. We give the generalized Binet formula, combinatorial representation and some relations involving the generalized order-k Fibonacci and Lucas numbers.

متن کامل

How to Eliminate Collusion in Tenders and Auctions, using Game Theory (Determination of Ceiling and Floor Prices)

Governments and firms in accordance to their duties, obliged to inevitably contracts with Individuals and legal entities, especially in auction and tender process. Since, the law of conducting tenders and auctions is lacking efficiency and has major objection, therefore, this has led to the dissemination and development of areas of corruption in these contracts (through collusion). In this pape...

متن کامل

On the Fibonacci and Lucas p-numbers, their sums, families of bipartite graphs and permanents of certain matrices

In this paper we consider certain generalizations of the well-known Fibonacci and Lucas numbers, the generalized Fibonacci and Lucas p-numbers. We give relationships between the generalized Fibonacci p-numbers, Fp(n), and their sums, Pn i1⁄41F pðiÞ, and the 1-factors of a class of bipartite graphs. Further we determine certain matrices whose permanents generate the Lucas p-numbers and their sum...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Formalized Mathematics

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2010